翻訳と辞書 Words near each other ・ Polygrammodes herminealis ・ Polygrammodes hintzi ・ Polygrammodes hyalescens ・ Polygon Magic ・ Polygon Man ・ Polygon mesh ・ Polygon moray ・ Polygon partition ・ Polygon Pictures ・ Polygon Records ・ Polygon Records discography ・ Polygon soup ・ Polygon Spur ・ Polygon triangulation ・ Polygon Wood, Zonnebeke ・ Polygon-circle graph ・ Polygona ・ Polygona abbotti ・ Polygona angulata ・ Polygona bayeri ・ Polygona concentrica ・ Polygona filosa ・ Polygona infundibulum ・ Polygona jucunda ・ Polygona lactea ・ Polygona martini ・ Polygona socorroensis ・ Polygona tumens ・ Polygonaceae ・ Polygonal Barn Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Polygon-circle graph ： ウィキペディア英語版 Polygon-circle graph In the mathematical discipline of graph theory, a polygon-circle graph, also called a spider graph, is a type of an intersection graph, where each vertex is represented as a polygon and each edge as an intersection of two polygons representing those vertices, enclosed by a bounding circle. All corners of all polygons lie on the bounding circle. They were first suggested by Michael Fellows in 1988. A polygon-circle graph can be represented as an "alternating sequence". Such a sequence can be gained by cutting the bounding circle in an arbitrary point and listing the polygons, as we go along. Such sequence is unique. ==Recognition== M. Koebe announced a polynomial time recognition algorithm,〔M. Koebe. ''On a new class of intersection graphs'' in Proceedings of the Fourth Czechoslovak Symposium on Combinatorics Prachatice, pages 141–143, 1990.〕 but it was never published. The algorithm was first published by M. Pergel and J. Kratochvíl.〔M. Pergel. ''Special Graph Classes and Algorithms on Them''. Doctoral Thesis, 2007.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Polygon-circle graph」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.